EasyTicket: a ticket routing recommendation engine for enterprise problem resolution

نویسندگان

  • Qihong Shao
  • Yi Chen
  • Shu Tao
  • Xifeng Yan
  • Nikos Anerousis
چکیده

Managing problem tickets is a key issue in IT service industry. A large service provider may handle thousands of problem tickets from its customers on a daily basis. The efficiency of processing these tickets highly depends on ticket routing—transferring problem tickets among expert groups in search of the right resolver to the ticket. Despite that many ticket management systems are available, ticket routing in these systems is still manually operated by support personnel. In this demo, we introduce EasyTicket, a ticket routing recommendation engine that helps automate this process. By mining ticket history data, we model an enterprise social network that represents the functional relationships among various expert groups in ticket routing. Based on this network, our system then provides routing recommendations to new tickets. Our experimental studies on 1.4 million real-world problem tickets show that on average, EasyTicket can improve the efficiency of ticket routing by 35%.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Content-Aware Resolution Sequence Mining for Ticket Routing

Ticket routing is key to the efficiency of IT problem management. Due to the complexity of many reported problems, problem tickets typically need to be routed among various expert groups, to search for the right resolver. In this paper, we study the problem of using historical ticket data to make smarter routing recommendations for new tickets, so as to improve the efficiency of ticket routing,...

متن کامل

The enhanced ticket-based routing algorithm

The Delay-constrained least-cost routing problem is to find the least cost path which satisfies a given delay constraint. There are two major difficulties to solve this problem. The first difficulty is the NP-Completeness of this routing problem. The second difficulty is that the networking information used for routing may be imprecise. The ticket-based routing (TBR) algorithm[1], aiming to fin...

متن کامل

Continuous FAQ Updating for Service Incident Ticket Resolution

Abstract—As enterprise computing becomes more and more complex, the costs and technical challenges of IT system maintenance and support are increasing rapidly. One popular approach to managing IT system maintenance is to prepare and use a FAQ (Frequently Asked Questions) system to manage and reuse systems knowledge. Such a FAQ system can help reduce the resolution time for each service incident...

متن کامل

Enhanced Ticket - Based Qos Routing Algorithms

Quality of Service (QoS) routing in computer networks is an important component in QoS architectures in order to provide end-to-end QoS support. Two major issues make QoS routing difficult: (1) Most of the QoS routing problems are NP-hard, such as the Delay Constraint Least Cost Routing (DCLCR) problem; (2) Imprecise network information degrades the routing performance. Using DCLCR problem as a...

متن کامل

STOCHASTIC VEHICLE ROUTING PROBLEMS WITH SIMULTANEOUS PICKUP AND DELIVERY SERVICES

The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban pub...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • PVLDB

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2008